On the Computational Power and Super-turing Capabilities of Dynamical Systems Ecole Normale Supérieure De Lyon on the Computational Power and Super-turing Capabilities of Dynamical Systems

نویسندگان

  • Olivier Bournez
  • Michel Cosnard
چکیده

We explore the simulation and computational capabilities of dynamical systems. We rst introduce and compare several notions of simulation between discrete systems. We give a general framework that allows dynamical systems to be considered as computational machines. We introduce a new discrete model of computation: the analog automaton model. We determine the computational power of this model and prove that it does have super-Turing capabilities. We then prove that many very simple dynamical systems from literature are actually able to simulate analog automata. From this result we deduce that many dynamical systems have intrinsically super-Turing capabilities. Nous etudions la puissance de calcul et de simulation des syst emes dy-namiques. Dans un premier temps, nous introduisons et comparons plusieurs notions de simulation entre syst emes discrets. Nous donnons un cadre g en eral permettant de consid erer les syst emes dynamiques comme des mod eles de calcul. Nous d eenissons un nouveau mod ele de calcul: le mod ele des automates analogiques. Nous d eterminons la puissance de calcul de ce mod ele et prouvons qu'il poss ede des capacit es super-Turing. Nous prouvons alors que des syst emes dynamiques tr es simples tir es de la litt erature sont en fait capable de simuler les automates analogiques. De ces r esultats, nous en d eduisons que beaucoup des syt emes dynamiques ont intrins equement des capacit es super-Turing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the computational power and super Turing capabilities of dynamical systems

We explore the simulation and computational capabilities of dynamical systems We rst introduce and compare several notions of simulation between discrete systems We give a general framework that allows dynamical systems to be considered as computational machines We introduce a new discrete model of computation the analog automaton model We determine the computational power of this model and pro...

متن کامل

The Super-Turing Computational Power of plastic Recurrent Neural Networks

We study the computational capabilities of a biologically inspired neural model where the synaptic weights, the connectivity pattern, and the number of neurons can evolve over time rather than stay static. Our study focuses on the mere concept of plasticity of the model so that the nature of the updates is assumed to be not constrained. In this context, we show that the so-called plastic recurr...

متن کامل

On the Computational Power of Dynamical Systems and Hybrid Systems

We explore the simulation and computational capabilities of discrete and continuous dynamical systems. We introduce and compare several notions of simulation between discrete and continuous systems. We give a general framework that allows discrete and continuous dynamical systems to be considered as computational machines. We introduce a new discrete model of computation: the analog automaton m...

متن کامل

Achilles and the Tortoise Climbing up the Hyper-arithmetical Hierarchy Ecole Normale Supérieure De Lyon Achilles and the Tortoise Climbing up the Hyper-arithmetical Hierarchy

We pursue the study of the computational power of Piecewise Constant Derivative PCD systems started in PCD systems are dynamical systems de ned by a piecewise constant di erential equation and can be considered as computational machines working on a continuous space with a continuous time We prove that the languages recognized by rational PCD systems in dimension d k respectively d k k in nite ...

متن کامل

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995